PRIVACY PRESERVING PATTERN MATCHING ON SEQUENCES OF EVENTS
نویسندگان
چکیده
منابع مشابه
AU2EU: Privacy-Preserving Matching of DNA Sequences
Advances in DNA sequencing create new opportunities for the use of DNA data in healthcare for diagnostic and treatment purposes, but also in many other health and well-being services. This brings new challenges with regard to the protection and use of this sensitive data. Thus, special technical means of protection should safeguard critical DNA data and create trust for patients and consumers o...
متن کاملPrivacy-preserving Ontology Matching
Increasingly, there is a recognized need for secure information sharing. In order to implement information sharing between diverse organizations, we need privacypreserving interoperation systems. In this work, we describe two frameworks for privacy-preserving interoperation systems. Ontology matching is an indispensable component of interoperation systems. To implement privacy-preserving intero...
متن کاملPattern Matching on Weighted Sequences
Weighted sequences are used extensively as profiles for protein families, in the representation of binding sites and often for the representation of sequences produced by a shotgun sequencing strategy. We present various fundamental pattern matching problems on weighted sequences and their respective algorithms. In addition, we define two matching probabilistic measures and we give algorithms f...
متن کاملPrivacy-Preserving Sequential Pattern Release
We investigate situations where releasing frequent sequential patterns can compromise individual’s privacy. We propose two concrete objectives for privacy protection: k-anonymity and α-dissociation. The first addresses the problem of inferring patterns with very low support, say, in [1, k). These inferred patterns can become quasi-identifiers in linking attacks. We show that, for all but one de...
متن کاملOn-line fuzzy pattern matching on sequences
We consider pattern matching problems where patterns are presented as sequences of fuzzy constraints on input elements. Given an infinite alphabet A, a pattern P [α,β] is a sequence μi1 , μi2 , ..., μim ® of membership functions μij defined on A. The pattern P fuzzy matches an input sequence t ∈ A∗ if t = ux1x2 · · ·xmv such that
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computing
سال: 2014
ISSN: 2312-5381,1727-6209
DOI: 10.47839/ijc.4.3.367